Controlled Genetic Programming Search for Solving Deceptive Problems a Thesis Submitted to the Graduate School of Natural and Applied Sciences
نویسنده
چکیده
CONTROLLED GENETIC PROGRAMMING SEARCH FOR SOLVING DECEPTIVE PROBLEMS Korkmaz, Emin Erkan Ph.D., Department of Computer Engineering Supervisor: Asso . Prof. Dr. G okt urk U oluk Mar h 2003, 77 pages Traditional Geneti Programming randomly ombines subtrees by applying rossover. There is a growing interest in methods that an ontrol su h re ombination operations. In this thesis, a new approa h is presented for guiding the re ombination pro ess for Geneti Programming. The method is based on extra ting the global information of the promising solutions that appear during the geneti sear h. The aim is to use this information to ontrol the rossover operation afterwards. A separate ontrol module is used to pro ess the olle ted information. This module guides the sear h pro ess by sending feedba k to the geneti engine about the onsequen es of possible re ombination alternatives.
منابع مشابه
Shuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملMathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کامل